Ììì Ääòùü Ããöòòð × Ððüüüðð Èöóù Blockinø¹ääòò Ö Blockin Blockin Ëìêêì Ììì Ääòùü Öòòð ×óùö Øööö × Ùùù´½¾¾ Ååµ Òò Ò­­üüüðð´´

The Linux kernel sour e tree is huge (> 125 MB) and in exible (be ause it is diÆ ult to add new kernel omponents). We propose to make this ar hite ture more exible by assembling kernel sour e trees dynami ally from individual kernel omponents. Users then, an sele t what omponent they really need. Hardware vendors an easily support the Linux platform by providing additional separately developed kernel omponents. We demonstrate how the kernel's build pro ess an be setup for this approa h and how individual build pro esses look like. We use a te hnique alled source tree composition to assemble sour e trees of omponents. We demonstrate how it is automated by the tool autobundle. We also propose a kernel omponent base as entral repository of kernel omponents. It forms a entral meeting point for kernel developers and users. 1998 ACM Computing Classi ation System: D.2.2, D.2.7, D.2.9, D.2.10, D.2.11, D.2.12, D.12.13, D.2.m